Dynamic Multi-Frequency, Multi-Hop Wireless Cellular Networks

نویسندگان

  • JaeSheung Shin
  • Parthu Kishen
  • Thomas F. La Porta
چکیده

Multi-hop relaying in cellular networks can greatly increase capacity and performance by exploiting the best available relay links to a base station. We envision an environment in which relay networks are dynamically formed when performance on the radio access network is degraded and then dissolved when the performance improves or the radio spectrum on which the relay network is operating is reclaimed. Each relay network operates on a different frequency band. Likewise, a relay network may channelize its frequency band to offer non-interfering links between the mobile nodes within a single relay network. In this paper, we propose a set of algorithms used to form such relay networks on-demand. Each algorithm provides a simple and distributed frequency assignment scheme. We evaluate these algorithms in terms of several metrics indicating the overhead of the relay network formation. The evaluation results show that having nodes outmost from the BS initiate route discovery first is the best approach for reducing the formation overhead. We also measure the throughput of the resulting relay networks. The results show that there is a large performance gain when using multiple frequencies in a relay network. Further, the performance of the network using multiple frequencies based on our simple frequency assignment is very close to that of a network using optimal frequency assignment. Dynamic Multi-Frequency, Multi-Hop Wireless Cellular Networks JaeSheung Shin, Parthu Kishen, Thomas F. La Porta Networking and Security Research Center Department of Computer Science and Engineering The Pennsylvania State University University Park, PA 16802 E-Mail: {jsshin, kishen, tlp}@cse.psu.edu ABSTRACT Multi-hop relaying in cellular networks can greatly increase capacity and performance by exploiting the best available relay links to a base station. We envision an environment in which relay networks are dynamically formed when performance on the radio access network is degraded and then dissolved when the performance improves or the radio spectrum on which the relay network is operating is reclaimed. Each relay network operates on a different frequency band. Likewise, a relay network may channelize its frequency band to offer non-interfering links between the mobile nodes within a single relay network. In this paper, we propose a set of algorithms used to form such relay networks on-demand. Each algorithm provides a simple and distributed frequency assignment scheme. We evaluate these algorithms in terms of several metrics indicating the overhead of the relay network formation. The evaluation results show that having nodes outmost from the BS initiate route discovery first is the best approach for reducing the formation overhead. We also measure the throughput of the resulting relay networks. The results show that there is a large performance gain when using multiple frequencies in a relay network. Further, the performance of the network using multiple frequencies based on our simple frequency assignment is very close to that of a network using optimal frequency assignment. TOPIC Mobile network architectures mobile networks beyond the 3rd generation Multi-hop relaying in cellular networks can greatly increase capacity and performance by exploiting the best available relay links to a base station. We envision an environment in which relay networks are dynamically formed when performance on the radio access network is degraded and then dissolved when the performance improves or the radio spectrum on which the relay network is operating is reclaimed. Each relay network operates on a different frequency band. Likewise, a relay network may channelize its frequency band to offer non-interfering links between the mobile nodes within a single relay network. In this paper, we propose a set of algorithms used to form such relay networks on-demand. Each algorithm provides a simple and distributed frequency assignment scheme. We evaluate these algorithms in terms of several metrics indicating the overhead of the relay network formation. The evaluation results show that having nodes outmost from the BS initiate route discovery first is the best approach for reducing the formation overhead. We also measure the throughput of the resulting relay networks. The results show that there is a large performance gain when using multiple frequencies in a relay network. Further, the performance of the network using multiple frequencies based on our simple frequency assignment is very close to that of a network using optimal frequency assignment. TOPIC Mobile network architectures mobile networks beyond the 3rd generation

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks

Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...

متن کامل

A multi-hop PSO based localization algorithm for wireless sensor networks

A sensor network consists of a large number of sensor nodes that are distributed in a large geographic environment to collect data. Localization is one of the key issues in wireless sensor network researches because it is important to determine the location of an event. On the other side, finding the location of a wireless sensor node by the Global Positioning System (GPS) is not appropriate du...

متن کامل

Target Tracking Based on Virtual Grid in Wireless Sensor Networks

One of the most important and typical application of wireless sensor networks (WSNs) is target tracking. Although target tracking, can provide benefits for large-scale WSNs and organize them into clusters but tracking a moving target in cluster-based WSNs suffers a boundary problem. The main goal of this paper was to introduce an efficient and novel mobility management protocol namely Target Tr...

متن کامل

Power and Frequency Efficient Wireless Multi-Hop Virtual Cellular Concept

Recently, major services provided by mobile communications systems are shifting from voice conversations to data communications over the Internet. There is a strong demand for increasing the data transmission rate. However, an important problem arises; larger peak transmit power is required as transmission rate becomes higher. In this paper, we propose a wireless multi-hop virtual cellular conc...

متن کامل

Chapter 5 : MULTI - HOP WIRELESS NETWORKS

In cellular and wireless local area networks, wireless communication only occurs on the last link between a base station and the wireless end system. In multi-hop wireless networks there are one or more intermediate nodes along the path that receive and forward packets via wireless links. Multi-hop wireless networks have several benefits: Compared to networks with single wireless links, multi-h...

متن کامل

Dynamic Task Allocation in Multi-Hop Multimedia Wireless Sensor Networks with Low Mobility

This paper presents a task allocation-oriented framework to enable efficient in-network processing and cost-effective multi-hop resource sharing for dynamic multi-hop multimedia wireless sensor networks with low node mobility, e.g., pedestrian speeds. The proposed system incorporates a fast task reallocation algorithm to quickly recover from possible network service disruptions, such as node or...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006